strip packing造句

• Discrete particle swarm algorithm for the rectangular strip packing problem
  离散粒子群优化算法求解矩形件排样问题
• In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems , one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio , another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan , we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1 . 6
  第一个算法利用装箱问题中的ff ( firstfit )算法求解极大化按期完工工件数的平行机排序问题pm d _ j = d n - u _ j ，该近似算法具有渐近性能比下界。第二个近似算法利用二维装箱中strippacking问题的算法求解以极小化makespan为目标的带并行工件的平行机排序问题，该算法的渐近性能比具有下界1 . 5和上界1 . 6 。